A Solution to the PoplMark Challenge in Isabelle/HOL
نویسنده
چکیده
We present a solution to the PoplMark challenge designed by Aydemir et al., which has as a goal the formalization of the metatheory of System F<:. The formalization is carried out in the theorem prover Isabelle/HOL using an encoding based on de Bruijn indices. We start with a relatively simple formalization covering only the basic features of System F<:, and explain how it can be extended to also cover records and more advanced binding constructs.
منابع مشابه
To arrive where we started: experience of mechanizing binding
We discuss experience gained from several case studies involving binding. Our main goal is a representation and libraries which enable fast mechanization of metatheory. Our secondary goal, which is not universally shared, is that mechanized proofs should be as close as possible to informal proofs. The mechanized case studies are: type soundness for MiniML; type soundness for TAPL fragments; a v...
متن کاملTermination of Isabelle Functions via Termination of Rewriting
We show how to automate termination proofs for recursive functions in (a first-order subset of) Isabelle/HOL by encoding them as term rewrite systems and invoking an external termination prover. Our link to the external prover includes full proof reconstruction, where all necessary properties are derived inside Isabelle/HOL without oracles. Apart from the certification of the imported proof, th...
متن کاملCardinals in Isabelle/HOL
We report on a formalization of ordinals and cardinals in Isabelle/HOL. A main challenge we faced is the inability of higher-order logic to represent ordinals canonically, as transitive sets (as done in set theory). We resolved this into a “decentralized” representation that identifies ordinals with wellorders, with all concepts and results proved to be invariant under order isomorphism. We als...
متن کاملMechanized metatheory revisited (abstract)
Over a decade ago, the POPLmark challenge [2] suggested that the theorem proving community had tools that were close to being usable by programming language researchers to formally prove properties of their designs and implementations. The authors of the POPLmark challenge looked at existing practices and systems and urged the developers of proof assistants to make improvements to existing syst...
متن کاملImporting HOL into Isabelle/HOL
We developed an importer from both HOL 4 and HOL-light into Isabelle/HOL. The importer works by replaying proofs within Isabelle/HOL that have been recorded in HOL 4 or HOL-light and is therefore completely safe. Concepts in the source HOL system, that is types and constants, can be mapped to concepts in Isabelle/HOL; this facilitates a true integration of imported theorems and theorems that ar...
متن کامل